On semiring complexity of Schur polynomials
نویسندگان
چکیده
Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that semiring complexity of a Schur polynomial sλ(x1, . . . , xk) labeled by a partition λ = (λ1 ≥ λ2 ≥ · · · ) is bounded by O(log(λ1)) provided the number of variables k is fixed.
منابع مشابه
Tropicalization, symmetric polynomials, and complexity
D. Grigoriev-G. Koshevoy recently proved that tropical Schur polynomials have (at worst) polynomial tropical semiring complexity. They also conjectured tropical skew Schur polynomials have at least exponential complexity; we establish a polynomial complexity upper bound. Our proof uses results about (stable) Schubert polynomials, due to R. P. Stanley and S. Billey-W. Jockusch-R. P. Stanley, tog...
متن کاملComplexity of tropical Schur polynomials
We study the complexity of computation of a tropical Schur polynomial Tsλ where λ is a partition, and of a tropical polynomial Tmλ obtained by the tropicalization of the monomial symmetric function mλ. Then Tsλ and Tmλ coincide as tropical functions (so, as convex piece-wise linear functions), while differ as tropical polynomials. We prove the following bounds on the complexity of computing ove...
متن کاملFactorization of Polynomials in One Variable over the Tropical Semiring
We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization problem which are not polynomial time in the degree, but are polynomial time for polynomials of fixed degree. For two-variable polynomials we derive an irreduc...
متن کاملSome Necessary Conditions for Schur Stability of Polynomials
This paper concerns the Schur stability of polynomials. Firstly necessary conditions are presented for the Schur stability of complex polynomials with fixed coefficients based on the discrete Hermite-Biehler theorem. Then the result is applied to obtain necessary conditions for the robust Schur stability of real interval polynomials.
متن کاملFinite Tree Automata with Cost Functions
Cost functions for tree automata are mappings from transitions to (tuples o0 polynomials over some semiring. We consider four semirings, namely N the semiring of nonnegative integers, A the "arctical semiring", T the tropical semiring and F the semiring of finite subsets of nonnegative integers. We show: for semirings N and A it is decidable in polynomial time whether or not the costs of accept...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1608.05043 شماره
صفحات -
تاریخ انتشار 2016